ITERATIVE AGGREGATION METHOD FOR SOLVING PRINCIPAL COMPONENT ANALYSIS PROBLEMS
نویسندگان
چکیده
منابع مشابه
Iterative Aggregation Method for Solving Principal Component Analysis Problems
Motivated by the previously developed multilevel aggregation method for solving structural analysis problems a novel two-level aggregation approach for efficient iterative solution of Principal Component Analysis (PCA) problems is proposed. The course aggregation model of the original covariance matrix is used in the iterative solution of the eigenvalue problem by a power iterations method. The...
متن کاملSolving network design problems via iterative aggregation
In this work, we present an exact approach for solving network design problems that is based on an iterative graph aggregation procedure. The scheme allows existing preinstalled capacities. Starting with an initial aggregation, we solve a sequence of network design master problems over increasingly fine-grained representations of the original network. In each step, a subproblem is solved that e...
متن کاملFast Iterative Kernel Principal Component Analysis
We develop gain adaptation methods that improve convergence of the Kernel Hebbian Algorithm (KHA) for iterative kernel PCA (Kim et al., 2005). KHA has a scalar gain parameter which is either held constant or decreased according to a predetermined annealing schedule, leading to slow convergence. We accelerate it by incorporating the reciprocal of the current estimated eigenvalues as part of a ga...
متن کاملKernel Hebbian Algorithm for Iterative Kernel Principal Component Analysis
A new method for performing a kernel principal component analysis is proposed. By kernelizing the generalized Hebbian algorithm, one can iteratively estimate the principal components in a reproducing kernel Hilbert space with only linear order memory complexity. The derivation of the method and preliminary applications in image hyperresolution are presented. In addition, we discuss the extensio...
متن کاملA New Iterative Method for Solving Initial Value Problems
In this paper, we introduce a new parameter iteration method (P-Iteration for short) ,which can be applied on Adams-Moulton methods to solve initial value problems. Compared with Jacobi iteration method, it has three advantages: (1) it may significantly implement the stable region of the iterative process such that we can efficiently use the large stable region of implicit formula; (2) it allow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Computational Civil and Structural Engineering
سال: 2017
ISSN: 2588-0195,2587-9618
DOI: 10.22337/2587-9618-2017-13-4-47-52